|
Imperialist competitive algorithm based on multiple search strategy for solving traveling salesman problem
CHEN Menghui, LIU Junlin, XU Jianfeng, LI Xiangjun
Journal of Computer Applications
2019, 39 (10):
2992-2996.
DOI: 10.11772/j.issn.1001-9081.2019030434
The imperialist competitive algorithm is a swarm intelligence optimization algorithm with strong local search ability, but excessive local search will lead to the loss of diversity and fall into local optimum. Aiming at this problem, an Imperialist Competitive Algorithm based on Multiple Search Strategy (MSSICA) was proposed. The country was defined as a feasible solution and the kingdoms were defined as four mechanisms of combinatorial artificial chromosome with different characteristics. The block mechanism was used to retain the dominant solution fragment during search and differentiated mechanisms of combinatorial artificial chromosome was used for different empires to search the effective and feasible solution information of different solution spaces. When it come to the local optimum, the multiple search strategy was used to inject a uniformly distributed feasible solution to replace a less advantageous solution to enhance the diversity. Experimental results show that the multiple search strategy can effectively improve diversity of the imperialist competitive algorithm and improve the quality and stability of the solution.
Reference |
Related Articles |
Metrics
|
|